A polynomial recognition algorithm for balanced matrices
نویسنده
چکیده
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti, Cornuéjols and Rao [9], and Conforti, Cornuéjols, Kapoor and Vušković [6], provided a polynomial algorithm to test balancedness of a matrix. In this paper we present a simpler polynomial algorithm, based on techniques introduced by Chudnovsky and Seymour in [3] for Berge graphs.
منابع مشابه
Balanced 0, ±1 Matrices Part II. Recognition Algorithm
In this paper we give a polynomial time recognition algorithm for balanced 0; 1 matrices. This algorithm is based on a decomposition theorem proved in a companion paper.
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملBalanced 0, ±1 Matrices Part I. Decomposition
A 0; 1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This paper extends the decomposition of balanced 0; 1 matrices obtained by Conforti, Cornu ejols and Rao to the class of balanced 0; 1 matrices. As a consequence, we obtain a polynomial time algorithm for recognizing balanced 0; 1 matrices.
متن کاملBalanced State Representations from Higher Order Differential Equations
We present an algorithm to compute a balanced state representation of a system from its description in terms of polynomial matrices and higher-order differential equations.
متن کاملDecomposition of Balanced Matrices
A 0; 1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per row and per column. We show that a balanced 0,1 matrix is either totally unimodular or its bipartite representation has a cutset consisting of two adjacent nodes and some of their neighbors. This result yields a polytime recognition algorithm for balancedness. To prove the result, we rst prove a d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 95 شماره
صفحات -
تاریخ انتشار 2005